Box-Rectangular Drawings of Plane Graphs
نویسندگان
چکیده
In this paper we introduce a new drawing style of a plane graph G called a box-rectangular drawing. It is defined to be a drawing of G on an integer grid such that every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal line segment or a vertical line segment, and the contour of each face is drawn as a rectangle. We establish a necessary and sufficient condition for the existence of a box-rectangular drawing of G. We also give a linear-time algorithm to find a box-rectangular drawing of G if it exists. 2000 Academic Press
منابع مشابه
Efficient Algorithms for Drawing Planar Graphs
This thesis presents efficient algorithms for drawing planar graphs. Graph drawing addresses the problem of constructing geometric representation of information and finds applications in almost every branch of science and technology. In this thesis we study rectangular drawings, orthogonal drawings, convex drawings and our newly defined box-rectangular drawings. Rectangular drawings and box-rec...
متن کاملBox-Rectangular Drawings of Planar Graphs
A plane graph is a planar graph with a fixed planar embedding in the plane. In a boxrectangular drawing of a plane graph, every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal line segment or a vertical line segment, and the contour of each face is drawn as a rectangle. A planar graph is said to have a box-rectangular drawing if at least one of its plane ...
متن کاملAlgorithms for Drawing Plane Graphs
Graph drawing addresses the problem of constructing geometric representation of information and finds applications in almost every branch of science and technology. Efficient algorithms are essential for automatic drawings of graphs, and hence a lot of research has been carried out in the last decade by many researchers over the world to develop efficient algorithms for drawing graphs. In this ...
متن کاملA Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs
In this paper we introduce a new drawing style of a plane graph G, called proper box rectangular (PBR) drawing. It is deened to be a drawing of G such that every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal or a vertical line segment, and each face is drawn as a rectangle. We establish necessary and suucient conditions for G to have a PBR drawing. We a...
متن کاملA Note on Plus-Contacts, Rectangular Duals, and Box-Orthogonal Drawings
A plus-contact representation of a planar graph G is called c-balanced if for every plus shape v, the number of other plus shapes incident to each arm of v is at most c∆+O(1), where ∆ is the maximum degree of G. Although small values of c have been achieved for a few subclasses of planar graphs (e.g., 2and 3-trees), it is unknown whether c-balanced representations with c < 1 exist for arbitrary...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Algorithms
دوره 37 شماره
صفحات -
تاریخ انتشار 1999